Breaking an Efficient Anonymous Channel
نویسنده
چکیده
At Eurocrypt 1993, Park, Itoh, and Kurosawa presented an “all/nothing election scheme and anonymous channel”. The schemes are based on the mix-net and the election scheme constructed from this anonymous channel (Chaum 1981). One of the two main improvements is that the messages sent by normal participants are significantly shorter in the two new anonymous channels. However, we show several successful attacks on these channels and thus on the secrecy of the votes in the election scheme. They break the first, more efficient channel completely. For the second channel and the election protocol, we present some countermeasures against all our attacks. Note, however, that we do not guarantee security even then, and that the specification of that channel is somewhat weaker than that of the original mix-net.
منابع مشابه
An efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملAnonymous Channel: a bucketized approach
1 Background 2 1.1 Characterization of Anonymous Channel Based on Indistinguishability . . . . . . . . . . . . 2 1.1.1 Definition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.1.2 Relations Proven . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 A Provably Secure And Efficient Countermeasure Against Timing Attacks . . . . . . . ...
متن کاملA New Anonymous Channel Protocol in Wireless Communications∗
In this paper, the authors shall propose a new anonymous channel protocol for wireless communications. Compared with Juang et al.’s protocol and Jan et al.’s protocol, our protocol is more efficient. In addition, our protocol saves the trouble of employing public key cryptography in the anonymous channel ticket authentication phase just as Jan et al.’s protocol.
متن کاملTor is not enough: Coercion in Remote Electronic Voting Systems
Current electronic voting systems require an anonymous channel during the voting phase to prevent coercion. Typically, low-latency anonymization-networks like Tor are used for this purpose. In this paper we devise a monitoring attack that allows an attacker to monitor whether participants of an election voted, despite the use of a low-latency network during the voting phase, thereby breaking an...
متن کاملSymmetry Breaking in Anonymous Networks: Characterizations
We characterize exactly the cases in which it is possible to elect a leader in an anonymous network of processors by a deterministic algorithm, and we show that for every network there is a weak election algorithm (i.e., if election is impossible all processors detect this fact in a distributed way).
متن کامل